Domains Based on Regular Types ?

Domains Based on Regular Types ? John P. Gallagher and Kim S. Henriksen Computer Science, Building 42.1, P.O. Box 260, Roskilde University, DK-4000 Denmark Email: {jpg,kimsh}@ruc.dk Abstract. We show how to transform a set of regular type definitions into a finite pre-interpretation for a logic program. The derived preinterpretation forms the basis for an abstract interpretation. The core of the transformation is a determinization procedure for non-deterministic finite tree automata. This approach provides a flexible and practical way We show how to transform a set of regular type definitions into a finite pre-interpretation for a logic program. The derived preinterpretation forms the basis for an abstract interpretation. The core of the transformation is a determinization procedure for non-deterministic finite tree automata. This approach provides a flexible and practical way of building program-specific analysis domains. We argue that the constructed domains are condensing: thus goal-independent analysis over the constructed domains loses no precision compared to goal-dependent analysis. We also show how instantiation modes such as ground, variable and non-variable can be expressed as regular types and hence integrated with other regular types. We highlight applications in binding time analysis for offline partial evaluation and infinite-state model checking. Experimental results and a discussion of complexity are included.